Complementing Feistel Ciphers
نویسندگان
چکیده
In this paper, we propose related-key differential distinguishers based on the complementation property of Feistel ciphers. We show that with relaxed requirements on the complementation, i.e. the property does not have to hold for all keys and the complementation does not have to be on all bits, one can obtain a variety of distinguishers. We formulate criteria sufficient for attacks based on the complementation property. To stress the importance of our findings we provide analysis of the full-round primitives: – For the hash mode of Camellia-128 without FL, FL−1 layers, differential multicollisions with 2 time – For GOST, practical recovery of the full key with 31 related keys and 2 time/data
منابع مشابه
Practically secure Feistel ciphers
In this paper we give necessary design principles to be used, when constructing secure Feistel ciphers. We introduce a new concept, practical security against linear and di erential attacks on Feistel ciphers. We give examples of such Feistel ciphers (practically) resistant to di erential attacks, linear attacks and other attacks.
متن کاملPractically Secure Feistel Cyphers
In this paper we give necessary design principles to be used, when constructing secure Feistel ciphers. We introduce a new concept, practical security against linear and differential attacks on Feistel ciphers. We give examples of such Feistel ciphers (practically) resistant to differential attacks, linear attacks and other attacks.
متن کاملBlock Ciphers And Cryptanalysis
This report gives a basic introduction to block cipher design and analysis. The concepts and design principles of block ciphers are explained, particularly the class of block ciphers known as Feistel ciphers. Some modern block cipher cryptanalysis methods are demonstrated by applying them to variants of a weak Feistel cipher called Simplified TEA (STEA), which is based on the Tiny Encryption Al...
متن کاملQuasigroup representation of some lightweight block ciphers
Most of the lightweight block ciphers are build as S-P networks or Feistel networks, their generalization or variations. We represent the lightweight Feistel ciphers GOST and MIBS, and Generalized Feistel cipher Skipjack by quasigroup string transformations. For obtaining suitable representation we use the fact that Feistel round functions that are bijections can be considered as orthomorphisms...
متن کاملCryptanalysis of Ladder-DES
Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel's construction. (2) Luby and Rackoo proved the security of a four-round Feistel construction when the round functions are random. (3) Recently several provably secure ciphers were suggested, which use other (assumed secur...
متن کامل